Strong Shift Equivalence Theory and the Shift Equivalence Problem
نویسندگان
چکیده
This paper discusses strong shift equivalence and counterexamples to the long standing Shift Equivalence Problem in symbolic dynamics. We also discuss how strong shift equivalence theory is closely related to areas of mathematics outside dynamics such as algebraic K-theory, cyclic homology, and topological quantum field theory.
منابع مشابه
The Work of Kim and Roush in Symbolic Dynamics
Contents 1. Introduction 1 2. Decidability results 1 3. Shift and strong shift equivalence for Boolean matrices 3 4. Strong shift equivalence of positive matrices over subrings of R 4 5. Automorphisms of the shift 4 6. The nonzero spectra of nonnegative integral matrices 6 7. The classification problem for shifts of finite type 6 8. Classification of free Z p actions on mixing SFTs 7 9. Topolog...
متن کاملStrong Shift Equivalence and the Generalized Spectral Conjecture for Nonnegative Matrices
Given matrices A and B shift equivalent over a dense subring R of R, with A primitive, we show that B is strong shift equivalent over R to a primitive matrix. This result shows that the weak form of the Generalized Spectral Conjecture for primitive matrices implies the strong form. The foundation of this work is the recent result that for any ring R, the group NK1(R) of algebraic K-theory class...
متن کاملAlgebraic Shift Equivalence and Primitive Matrices
Motivated by symbolic dynamics, we study the problem, given a unital subring 5 of the reals, when is a matrix A algebraically shift equivalent over S to a primitive matrix? We conjecture that simple necessary conditions on the nonzero spectrum of A are sufficient, and establish the conjecture in many cases. If S is the integers, we give some lower bounds on sizes of realizing primitive matrices...
متن کاملOn Some New Invariants for Strong Shift Equivalence for Shifts of Finite Type
We introduce a new computable invariant for strong shift equivalence of shifts of finite type. The invariant is based on an invariant introduced by Trow, Boyle, and Marcus, but has the advantage of being readily computable. We summarize briefly a large-scale numerical experiment aimed at deciding strong shift equivalence for shifts of finite type given by irreducible 2 × 2matrices with entry su...
متن کاملOn Lambda-graph Systems for Subshifts of Subshifts
Kengo Matsumoto has introduced λ-graph systems and strong shift equivalence of λ-graph systems [Doc.Math.4 (1999), 285-340]. We associate to a subshift of a subshift a λ-graph system. The strong shift equivalence class of the associated λ-graph system is an invariant of subsystem equivalence. Wolfgang Krieger and Kengo Matsumoto have introduced the λ-entropy of a λ-graph system and have shown i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999